Factor domination and minimum degree
نویسندگان
چکیده
منابع مشابه
Stratification and domination in graphs with minimum degree two
A graph G is 2-stratified if its vertex set is partitioned into two classes (each of which is a stratum or a color class). We color the vertices in one color class red and the other color class blue. Let F be a 2-stratified graph with one fixed blue vertex v specified. We say that F is rooted at v. The Fdomination number of a graphG is the minimum number of red vertices ofG in a red-blue colori...
متن کاملOn Independent Domination Number of Graphs with given Minimum Degree
We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that by J. Haviland 3] and settles Case = 2 of the corresponding conjecture by O. Favaron 2].
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملTight Upper Bounds for the Domination Numbers of Graphs with Given Order and Minimum Degree, II
Let γ(n, δ) denote the largest possible domination number for a graph of order n and minimum degree δ. This paper is concerned with the behavior of the right side of the sequence n = γ(n, 0) ≥ γ(n, 1) ≥ · · · ≥ γ(n, n− 1) = 1. We set δk(n) = max{δ | γ(n, δ) ≥ k}, k ≥ 1. Our main result is that for any fixed k ≥ 2 there is a constant ck such that for sufficiently large n, n− ckn ≤ δk+1(n) ≤ n− n...
متن کاملTight Upper Bounds for the Domination Numbers of Graphs With Given Order and Minimum Degree
Let γ(n, δ) denote the maximum possible domination number of a graph with n vertices and minimum degree δ. Using known results we determine γ(n, δ) for δ = 0, 1, 2, 3, n ≥ δ +1 and for all n, δ where δ = n − k and n is sufficiently large relative to k. We also obtain γ(n, δ) for all remaining values of (n, δ) when n ≤ 14 and all but 6 values of (n, δ) when n = 15 or 16.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2003
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00522-8